Some Classes of Valid Inequalities and Convex Hull Characterizations for Dynamic Fixed-Charge Problems under Nested Constraints

نویسندگان

  • Fred Glover
  • Hanif D. Sherali
چکیده

The authors also gratefully acknowledge the detailed comments of two anonymous referees regarding relationships with lot-sizing problems. ii Abstract This paper studies the polyhedral structure of dynamic fixed-charge problems that have nested relationships constraining the flow or activity variables. Constraints of this type might typically arise in hierarchical or multi-period models, but might also be induced among choices of key variables via an LP-based post-optimality analysis. In particular, this structure is also inherent in capacitated lot-sizing problems. We characterize several classes of valid inequalities and inductively derive convex hull representations in a higher dimensional space for such dynamic fixed-charge problems having nested constraints using lifting constructs based on the Reformulation-Linearization Technique (RLT). Relationships with certain known classes of valid inequalities for single item capacitated lot-sizing problems are also identified. This offers insights into how the RLT could be used as a unifying mechanism for generating such classes of valid inequalities, and prompts several research avenues that we propose for future investigation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Polyhedral Structure of Two-Level Lot-Sizing Problems with Supplier Selection

In this paper, we study a two-level lot-sizing problem with supplier selection (LSS). This NP-hard problem arises in different production planning and supply chain management applications. We first present a dynamic programming algorithm for LSS that is polynomial when the number of plants is fixed. We use this algorithm to describe the convex hull of solutions to the problem in an extended spa...

متن کامل

Multi-Item capacitated lot-Sizing problem with setup times and shortage costs : Polyhedral results

We address a multi-item capacitated lot-sizing problem with setup times and shortage costs that arises in real-world production planning problems. Demand cannot be backlogged, but can be totally or partially lost. The problem can be modelled as a mixed integer program and it is NP-hard. In this paper, we propose some classes of valid inequalities based on a generalization of Miller et al. [17] ...

متن کامل

Sequence Independent Lifting for Mixed Integer Programs with Variable Upper Bounds

We investigate the convex hull of the set defined by a single inequality with continuous and binary variables with variable upper bound constraints. We extend the traditional flow cover inequality, and show that it is valid for a restriction of the set in which some variables are fixed. We also give conditions under which this inequality is facet-defining and, when it is not, we show how it can...

متن کامل

Sequence independent lifting for 0−1 knapsack problems with disjoint cardinality constraints

In this paper, we study the set of 0−1 integer solutions to a single knapsack constraint and a set of non-overlapping cardinality constraints (MCKP). This set is a generalization of the traditional 0− 1 knapsack polytope and the 0− 1 knapsack polytope with generalized upper bounds. We derive strong valid inequalities for the convex hull of its feasible solutions by lifting the generalized cover...

متن کامل

Flow pack facets of the single node fixed-charge flow polytope

i∈N yi ≤ b, yi ≤ uixi ∀i ∈ N}, where variable yi is the flow on arc i with capacity ui, xi is a binary variable that indicates whether arc i is open or closed, and N = N ∪N. The single node fixed–charge flow model is interesting not only because it is a relaxation of the fixed–charge network flow problem, but also because it is possible to derive relaxations of the form S of a general MBIP prob...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Annals OR

دوره 140  شماره 

صفحات  -

تاریخ انتشار 2005